On the Suboptimality of Equidistant Codes Meeting the Plotkin Bound
نویسندگان
چکیده
. • They are called fair since it is constructed by an equal number of all possible such columns (the number is called L). • Each fair code can be constructed by duplicating C (M,L) fair many times. • The fair weak flip codes have a maximum minimum Hamming distance and achieve the Plotkin bound. • These codes are not optimal in the sense of average error probability over the binary symmetric channel (BSC).
منابع مشابه
On Plotkin-Optimal Codes over Finite Frobenius Rings
We study the Plotkin bound for codes over a finite Frobenius ring R equipped with the homogeneous weight. We show that for codes meeting the Plotkin bound, the distribution on R induced by projection onto a coordinate has an interesting property. We present several constructions of codes meeting the Plotkin bound and of Plotkin-optimal codes. We also investigate the relationship between Butson-...
متن کاملConstruction of Cyclic and Constacyclic Codes for b-symbol Read Channels Meeting the Plotkin-like Bound
The symbol-pair codes over finite fields have been raised for symbol-pair read channels and motivated by application of high-density data storage technologies [1, 2]. Their generalization is the code for b-symbol read channels (b > 2). Many MDS codes for b-symbol read channels have been constructed which meet the Singleton-like bound ([3, 4, 10] for b = 2 and [11] for b > 2). In this paper we s...
متن کاملNew bounds for codes over finite Frobenius rings
We give further results on the question of code optimality for linear codes over finite Frobenius rings for the homogeneous weight. This article improves on the existing Plotkin bound derived in an earlier paper [6], and suggests a version of a Singleton bound. We also present some families of codes meeting these new bounds.
متن کاملSome Remarks on the Plotkin Bound
In coding theory, Plotkin’s upper bound on the maximal cadinality of a code with minimum distance at least d is well known. He presented it for binary codes where Hamming and Lee metric coincide. After a brief discussion of the generalization to q-ary codes preserved with the Hamming metric, the application of the Plotkin bound to q-ary codes preserved with the Lee metric due to Wyner and Graha...
متن کاملOn Linear Codes over Z2s
In an earlier paper the authors studied simplex codes of type α and β over Z4 and obtained some known binary linear and nonlinear codes as Gray images of these codes. In this correspondence, we study weight distributions of simplex codes of type α and β over Z2s . The generalized Gray map is then used to construct binary codes. The linear codes meet the Griesmer bound and a few non-linear codes...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2013